Theoretical computer science

Results: 9916



#Item
31Overview and Analysis of the SAT Challenge 2012 Solver Competition Adrian Balinta,1 , Anton Belovb,2 , Matti Järvisaloc,3,∗, Carsten Sinzd,4 a Institute of Theoretical Computer Science, Ulm University, Germany. Email:

Overview and Analysis of the SAT Challenge 2012 Solver Competition Adrian Balinta,1 , Anton Belovb,2 , Matti Järvisaloc,3,∗, Carsten Sinzd,4 a Institute of Theoretical Computer Science, Ulm University, Germany. Email:

Add to Reading List

Source URL: www.cs.helsinki.fi

- Date: 2015-01-20 15:12:14
    32Variational Inference for Policy Search in changing Situations Gerhard Neumann GERHARD @ IGI . TU - GRAZ . AC . AT Institute for Theoretical Computer Science, Graz University of Technology, A-8010 Graz, Austria

    Variational Inference for Policy Search in changing Situations Gerhard Neumann GERHARD @ IGI . TU - GRAZ . AC . AT Institute for Theoretical Computer Science, Graz University of Technology, A-8010 Graz, Austria

    Add to Reading List

    Source URL: www.ias.informatik.tu-darmstadt.de

    - Date: 2012-10-26 11:44:14
      33Reasoning With Weighted Ontologies Rafael Pe˜ naloza Theoretical Computer Science TU Dresden, Germany

      Reasoning With Weighted Ontologies Rafael Pe˜ naloza Theoretical Computer Science TU Dresden, Germany

      Add to Reading List

      Source URL: ceur-ws.org

      - Date: 2009-07-07 04:46:34
        34Implementing completion-based inferences for the EL-family Julian Mendez and Andreas Ecke and Anni-Yasmin Turhan TU Dresden, Institute for Theoretical Computer Science Abstract. Completion algorithms for subsumption are

        Implementing completion-based inferences for the EL-family Julian Mendez and Andreas Ecke and Anni-Yasmin Turhan TU Dresden, Institute for Theoretical Computer Science Abstract. Completion algorithms for subsumption are

        Add to Reading List

        Source URL: ceur-ws.org

        - Date: 2011-06-26 10:24:23
          35Reintroducing CEL as an OWL 2 EL Reasoner⋆ Julian Mendez and Boontawee Suntisrivaraporn Theoretical Computer Science, TU Dresden, Germany {mendez,meng}@tcs.inf.tu-dresden.de Abstract. The CEL system is known for its s

          Reintroducing CEL as an OWL 2 EL Reasoner⋆ Julian Mendez and Boontawee Suntisrivaraporn Theoretical Computer Science, TU Dresden, Germany {mendez,meng}@tcs.inf.tu-dresden.de Abstract. The CEL system is known for its s

          Add to Reading List

          Source URL: ceur-ws.org

          - Date: 2009-07-07 04:46:34
            36OntoComP System Description Barı¸s Sertkaya ? Theoretical Computer Science, TU Dresden, Germany

            OntoComP System Description Barı¸s Sertkaya ? Theoretical Computer Science, TU Dresden, Germany

            Add to Reading List

            Source URL: ceur-ws.org

            - Date: 2009-07-07 04:46:34
              37GCIs Make Reasoning in Fuzzy DL with the Product T-norm Undecidable Franz Baader and Rafael Peñaloza Theoretical Computer Science, TU Dresden, Germany {baader,penaloza}@tcs.inf.tu-dresden.de

              GCIs Make Reasoning in Fuzzy DL with the Product T-norm Undecidable Franz Baader and Rafael Peñaloza Theoretical Computer Science, TU Dresden, Germany {baader,penaloza}@tcs.inf.tu-dresden.de

              Add to Reading List

              Source URL: ceur-ws.org

              - Date: 2011-06-26 10:20:56
                38Unification in the Description Logic EL Franz Baader and Barbara Morawska? Theoretical Computer Science, TU Dresden, Germany {baader,morawska}@tcs.inf.tu-dresden.de Abstract. The Description Logic EL has recently drawn

                Unification in the Description Logic EL Franz Baader and Barbara Morawska? Theoretical Computer Science, TU Dresden, Germany {baader,morawska}@tcs.inf.tu-dresden.de Abstract. The Description Logic EL has recently drawn

                Add to Reading List

                Source URL: ceur-ws.org

                - Date: 2009-07-07 04:46:34
                  39Axiom Pinpointing is Hard Rafael Pe˜ naloza and Barı¸s Sertkaya? Theoretical Computer Science TU Dresden, Germany {penaloza,sertkaya}@tcs.inf.tu-dresden.de

                  Axiom Pinpointing is Hard Rafael Pe˜ naloza and Barı¸s Sertkaya? Theoretical Computer Science TU Dresden, Germany {penaloza,sertkaya}@tcs.inf.tu-dresden.de

                  Add to Reading List

                  Source URL: ceur-ws.org

                  - Date: 2009-07-07 04:46:34
                    40Fuzzy Ontologies over Lattices with T-norms Stefan Borgwardt and Rafael Pe˜ naloza Theoretical Computer Science, TU Dresden, Germany {stefborg,penaloza}@tcs.inf.tu-dresden.de

                    Fuzzy Ontologies over Lattices with T-norms Stefan Borgwardt and Rafael Pe˜ naloza Theoretical Computer Science, TU Dresden, Germany {stefborg,penaloza}@tcs.inf.tu-dresden.de

                    Add to Reading List

                    Source URL: ceur-ws.org

                    - Date: 2011-06-26 10:20:01